Laplacian eigenvectors and eigenvalues and almost equitable partitions
نویسندگان
چکیده
منابع مشابه
Laplacian eigenvectors and eigenvalues and almost equitable partitions
Relations between Laplacian eigenvectors and eigenvalues and the existence of almost equitable partitions (which are generalizations of equitable partitions) are presented. Furthermore, on the basis of some properties of the adjacency eigenvectors of a graph, a necessary and sufficient condition for the graph to be primitive strongly regular is introduced. c © 2006 Elsevier Ltd. All rights rese...
متن کاملEigenvalues and Eigenvectors of the Discrete Laplacian
We derive explicit formulas for the eigenvalues and eigenvectors of the Discrete Laplacian on a rectangular grid for the standard finite difference and finite element methods in 1D, 2D, and 3D. Periodic, Dirichlet, Neumann, and mixed boundary conditions are all considered. We show how the higher dimensional operators can be written as sums of tensor products of one dimensional operators, and th...
متن کاملAlmost Eigenvalues and Eigenvectors of Almost Mathieu Operators
The almost Mathieu operator is the discrete Schrödinger operator Hα,β,θ on `2(Z) defined via (Hα,β,θf)(k) = f(k+1)+f(k−1)+β cos(2παk+θ)f(k). We derive explicit estimates for the eigenvalues at the edge of the spectrum of the finite-dimensional almost Mathieu operator H α,β,θ. We furthermore show that the (properly rescaled) m-th Hermite function φm is an approximate eigenvector of H α,β,θ, and ...
متن کاملEpidemic Outbreaks in Networks with Equitable or Almost-Equitable Partitions
We study the diffusion of epidemics on networks that are partitioned into local communities. The gross structure of hierarchical networks of this kind can be described by a quotient graph. The rationale of this approach is that individuals infect those belonging to the same community with higher probability than individuals in other communities. In community models the nodal infection probabili...
متن کاملEquitable Partitions and Orbit Partitions
We consider two kinds of partition of a graph, namely orbit partitions and equitable partitions. Although an orbit partition is always an equitable partition, the converse is not true in general. We look at some classes of graphs for which the converse is true.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2007
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2005.03.006